Two Lower Bounds for BPA
نویسندگان
چکیده
Branching bisimilarity on normed Basic Process Algebra (BPA) was claimed to be EXPTIMEhard in previous papers without any explicit proof. Recently it is reminded by Jančar that the claim is not so dependable. In this paper, we develop a new complete proof for EXPTIMEhardness of branching bisimilarity on normed BPA. We also prove the associate regularity problem on normed BPA is PSPACE-hard and in EXPTIME. This improves previous P-hard and NEXPTIME result. 1998 ACM Subject Classification F.4.2 Grammars and Other Rewriting Systems
منابع مشابه
Strict Lower Bounds for Model Checking BPA
We show strict lower bounds for the complexity of several model checking problems for BPA and branching-time logics. Model checking with Hennessy-Milner Logic PSPACE-hard, while model checking with the modal-calculus is EXPTIME-hard. By combining these results with already established upper bounds it follows that the model checking problems are PSPACE-complete and EXPTIME-complete, respectively.
متن کاملStrong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
Strong bisimilarity and regularity checking problems of Basic Process Algebra (BPA) are decidable, with the complexity upper bounds 2-EXPTIME. On the other hand, no lower bounds were known. In this paper we demonstrate PSPACE-hardness of these problems.
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملInfinite State Model-Checking of Propositional Dynamic Logics
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL∩ (which includes the intersection operator on programs) over various classes of infinite state systems (BPP, BPA, pushdown systems, prefix-recognizable systems) are studied. Precise upper and lower bounds are shown for the data/expression/combined complexity of these model-checking problems.
متن کاملUpper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کامل